Secure Key Management Based Mobile Authentication in Cloud

Authentication is important to the security of user data in a mobile cloud environment. Because of the server’s user credentials, it is subject to attacks. To maintain data authentication, a novel authentication mechanism is proposed. It consists of three independent phases: Registration, login, and authentication and key agreement. The user registers with the Registration Center (RC) by producing a secret number that isn’t stored in the phone, which protects against privileged insider attacks. The user and server generate a nonce for dynamic user identity and agree on a session secret key for safe communication. The passwords are not stored on the computer or provided in plain text, they are resistant to replay, guessing, and stolen verification attacks. The suggested protocol uses a one-way hash function and XOR operations, with the client having remote access to a large number of servers over a secure communication channel. Concentrates on HMAC and SHA3 for Collision Free Hashing and to overcome length extension attacks. HMACs are substantially less affected by collisions than their underlying hashing algorithms alone. So adding an HMAC to an MD5 or SHA hash would make it substantially more difficult to break via a rainbow table.     

Carbon Nanotube Reinforced Polyimide Thin-film for High Wear Durability

In this paper, the influence of single walled carbon nano tubes (SWCNTs) addition on the tribological properties of the polyimide (PI) films on silicon substrate was studied. PI films, with and without SWCNTs, were spin coated onto the Si surface. Coefficient of friction and wear durability were characterized using a ball-on-disk tribometer by employing a 4 mm diameter Si₃N₄ ball sliding against the film, at a contact pressure of ∼370 MPa, and a sliding velocity of 0.042 ms⁻¹. Water contact angle, AFM topography, and nano-indentation tests were conducted to study the physical and mechanical properties of the films. SWCNTs marginally increased the water contact angle of PI film. The addition of SWCNTs to PI has increased the hardness and elastic modulus of pristine PI films by 60–70%. The coefficient of friction of PI films increased slightly (∼20%) after the addition of SWCNTs, whereas, there was at least two-fold increase in the wear life of the film based on the film failure condition of coefficient of friction higher than 0.3. However, the film did not show any sign of wear even after 100,000 cycles of rotation indicating its robustness. This increase in the wear durability due to the addition of the SWCNTs is believed to be because of the improvement in the load-bearing capacity of the composite film and sliding induced microstructural changes of the composite film.     

Ultrathin PFPE Film Systems Fabricated by Covalent Assembly: An Application to Tribology

In this study, we have employed covalent molecular assembly to fabricate robust thin film structures comprising molecular layers and have demonstrated its application in tribology. An anhydride-functionalized polymer (gantrez) was deposited over an amine-functionalized silicon surface through covalent binding and employed as an intermediate layer between derivatized silicon and perfluoropolyether (PFPE). X-ray photoelectron spectroscopy, atomic force microscopy, and ellipsometry were employed to study the interfacial chemistry, morphology, and thickness of the assembled films. The films show excellent stability and strength against sonication, which can be attributed to the covalent interlayer linkage. Such films showed wear life of >100,000 cycles in ball-on-disk sliding tests at a normal load of 0.5 N and a sliding rotation of 200 rpm at a track radius of 3.2 mm. The performance was superior compared to that of PFPE-coated self assembled monolayers used as the lubricating layer. The film systems and assembly technique can be employed as nano-lubrication in several technological applications, such as information storage devices and micro-electro-mechanical systems.     

Characterisation of Seed Lipids from Bixa orellana and Trachyspermum copticum

Bixa orellana L. seeds possess a resinous lipid (6.3 %), which has a pungent and spicy odour. The seed is known for its medicinal properties such as anti‐inflammatory, antipyretic activity and as a cure for tonsilitis. Trachyspermum copticum L. seed is a well known digestive aid and relief from colic pain. T. copticum possesses essential oil rich in thymol (>50 %) and lipid (15.6 %). The present study was aimed to quantify lipid classes of these two species by silicic acid chromatography and analyze their fatty acid composition by gas chromatography (GC) and gas chromatography–mass spectrometry (GC–MS). It was observed that the seed lipids are rich in neutral lipids with 98.1 and 95.2 % and lower quantities of glycolipids of 1.5 and 3.8 % and phospholipids of 0.36 and 1.0 % in B. orellana and T. copticum, respectively. The fatty acid composition of B. orellana seed lipid showed major quantities of palmitic (26.9 %), linoleic (26.1 %), oleic (17.5 %), linolenic (15.1 %), stearic acid (10.8 %) and small quantities of eicosanoic acid (3.6 %). In T. copticum seed lipids, petroselinic acid (68.3 %) and linoleic acid (25.3 %) together constituted 93 % of the total lipid. The results revealed that the lipids after recovery of the essential components namely, bixin and volatile oil from B. orellana and T. copticum, respectively can be further explored for industrial applications.     

Artificial Neural Network modeling of a hydrogen dual fueled diesel engine characteristics: An experiment approach

The rapid growth of vehicular pollution; mostly running on the diesel engine, emissions emerging are the concerns of the day. Owing to clean burn characteristics features, Hydrogen (H₂) as a fuel is the paradigm of the researcher. Extensive research presented in the literature on H₂ dual fueled diesel engine reveals, the significant role of H₂ in reducing emissions and enhancing the performance of a dual fueled diesel engine. With meager qualitative experiment data, the feasibility to develop an efficient Artificial Neural Network (ANN) model is investigated, the developed model can be utilized as a tool to investigate the H₂ dual fueled diesel engine further. In the process of developing an ANN model, engine load and H₂ flow rate are varied to register performance and emission characteristics. The creditability of the experiment is ascertained with uncertainty analysis of measurable and computed parameters. Leave-out-one method is adopted with 16 data sets; seven training algorithms are explored with eight transfer function combinations to evolve a competent ANN model. The efficacy of the developed model is adjudged with standard benchmark statistic indices. ANN model trained with Broyden, Fletcher, Goldfarb, & Shanno (BFGS) quasi-Newton backpropagation (trainbfg) stand out the best among other algorithms with regression coefficient ranging between 0.9869 and 0.9996.     

Dynamic response of the bridge girders of E.O.T. Cranes due to dissimilar rail jointsDynamisches verhalten von kranbahnen infolge der schienenstöße

Though every care is taken at the time of laying rails for the E.O.T. Crane travel, the track is usually found to be imperfect. These imperfect rail joints produce greater dynamic deflections in the E.O.T. Crane bridge girders. Earlier investigations mainly deal with simultaneous similar type of joints. Joints of the dissimilar type occuring simultaneously produce dynamic deflections of high magnitudes and need to be avoided. Considering the bridge girder as a beam of constant flexural rigidity, the effects of dissimilar type of joints occuring simultaneously are studied by considering them as support excitation functions acting on either side of the bridge girder.     

Graph Complexity and Slice Functions

Abstract. A graph-theoretic approach to study the complexity of Boolean functions was initiated by Pudlák, Rödl, and Savický [PRS] by defining models of computation on graphs. These models generalize well-known models of Boolean complexity such as circuits, branching programs, and two-party communication complexity. A Boolean function f is called a 2-slice function if it evaluates to zero on inputs with less than two 1's and evaluates to one on inputs with more than two 1's. On inputs with exactly two 1's f may be nontrivially defined. There is a natural correspondence between 2-slice functions and graphs. Using the framework of graph complexity, we show that sufficiently strong superlinear monotone lower bounds for the very special class of {2-slice functions} would imply superpolynomial lower bounds over a complete basis for certain functions derived from them. We prove, for instance, that a lower bound of n ^1+Ω(1) on the (monotone) formula size of an explicit 2-slice function f on n variables would imply a 2 ^Ω(?) lower bound on the formula size over a complete basis of another explicit function g on l variables, where l=Θ( log n) . We also consider lower bound questions for depth-3 bipartite graph complexity. We prove a weak lower bound on this measure using algebraic methods. For instance, our result gives a lower bound of Ω(( log n) ³ / ( log log n) ⁵ ) for bipartite graphs arising from Hadamard matrices, such as the Paley-type bipartite graphs. Lower bounds for depth-3 bipartite graph complexity are motivated by two significant applications: (i) a lower bound of n ^Ω(1) on the depth-3 complexity of an explicit n -vertex bipartite graph would yield superlinear size lower bounds on log-depth Boolean circuits for an explicit function, and (ii) a lower bound of $\exp((\log \log n)^{\omega(1)})$ would give an explicit language outside the class Σ ₂ ^cc of the two-party communication complexity as defined by Babai, Frankl, and Simon [BFS]. Our lower bound proof is based on sign-representing polynomials for DNFs and lower bounds on ranks of ±1 matrices even after being subjected to sign-preserving changes to their entries. For the former, we use a result of Nisan and Szegedy [NS] and an idea from a recent result of Klivans and Servedio [KS]. For the latter, we use a recent remarkable lower bound due to Forster [F1].